Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Apostolico, Alberto")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 149

  • Page / 6
Export

Selection :

  • and

Fast gapped variants for Lempel-Ziv-Welch compressionAPOSTOLICO, Alberto.Information and computation (Print). 2007, Vol 205, Num 7, pp 1012-1026, issn 0890-5401, 15 p.Article

CPM : combinatorial pattern matching (Aarhus, June 30 - July 2, 1997)Apostolico, Alberto; Hein, Jotun.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63220-4, VIII, 274 p, isbn 3-540-63220-4Conference Proceedings

CPM 2002 : combinatorial pattern matching (Fukuoka, 3-5 July 2002)Apostolico, Alberto; Takeda, Masayuki.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43862-9, VIII, 288 p, isbn 3-540-43862-9Conference Proceedings

SPIRE 2004 : string processing and information retrieval (Padova, 5-8 October 2004)Apostolico, Alberto; Melucci, Massimo.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23210-9, XIV, 332 p, isbn 3-540-23210-9Conference Proceedings

Compact recognizers of episode sequencesAPOSTOLICO, Alberto; ATALLAH, Mikhail J.Information and computation (Print). 2002, Vol 174, Num 2, pp 180-192, issn 0890-5401Article

Pattern discovery in the post genomeAPOSTOLICO, Alberto; GIANCARLO, Raffaele.Theoretical computer science. 2005, Vol 335, Num 1, issn 0304-3975, 127 p.Serial Issue

A speed-up for the commute between subword trees and DAWGsAPOSTOLICO, Alberto; LONARDI, Stefano.Information processing letters. 2002, Vol 83, Num 3, pp 159-161, issn 0020-0190Article

A linear tree edit distance algorithm for similar ordered treesTOUZET, Hélène.Lecture notes in computer science. 2005, pp 334-345, issn 0302-9743, isbn 3-540-26201-6, 12 p.Conference Paper

Application of Lempel-Ziv factorization to the approximation of grammar-based compressionRYTTER, Wojciech.Lecture notes in computer science. 2002, pp 20-31, issn 0302-9743, isbn 3-540-43862-9, 12 p.Conference Paper

Practical software for aligning ESTs to human genomeOGASAWARA, Jun; MORISHITA, Shinichi.Lecture notes in computer science. 2002, pp 1-16, issn 0302-9743, isbn 3-540-43862-9, 16 p.Conference Paper

A better method for length distribution modeling in HMMs and its application to gene findingBREJOVA, Brona; VINAR, Tomas.Lecture notes in computer science. 2002, pp 190-202, issn 0302-9743, isbn 3-540-43862-9, 13 p.Conference Paper

An easy case of sorting by reversalsTRAN, N.Lecture notes in computer science. 1997, pp 83-89, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Cross-comparison for two-dimensional text categorizationDI NUNZIO, Giorgio Maria.Lecture notes in computer science. 2004, pp 125-126, issn 0302-9743, isbn 3-540-23210-9, 2 p.Conference Paper

Constructing NFAs by optimal use of positions in regular expressionsILIE, Lucian; SHENG YU.Lecture notes in computer science. 2002, pp 279-288, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Estimating the probability of approximate matchesKURTZ, S; MYERS, G.Lecture notes in computer science. 1997, pp 52-64, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Iterative versus simultaneous multiple sequence alignmentDRESS, A.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63220-4, p. 275Conference Paper

Space- and time-efficient decoding with canonical Huffman treesKLEIN, S. T.Lecture notes in computer science. 1997, pp 65-75, issn 0302-9743, isbn 3-540-63220-4Conference Paper

A new feature normalization scheme based on eigenspace for noisy speech recognitionLEE, Yoonjae; KO, Hanseok.Lecture notes in computer science. 2004, pp 76-78, issn 0302-9743, isbn 3-540-23210-9, 3 p.Conference Paper

A scalable system for identifying co-derivative documentsBERNSTEIN, Yaniv; ZOBEL, Justin.Lecture notes in computer science. 2004, pp 55-67, issn 0302-9743, isbn 3-540-23210-9, 13 p.Conference Paper

Block merging for off-line compressionWAN, Raymond; MOFFAT, Alistair.Lecture notes in computer science. 2002, pp 32-41, issn 0302-9743, isbn 3-540-43862-9, 10 p.Conference Paper

Direct construction of Compact Directed Acyclic Word graphsCROCHEMORE, M; VERIN, R.Lecture notes in computer science. 1997, pp 116-129, issn 0302-9743, isbn 3-540-63220-4Conference Paper

CPM 2005 : combinatorial pattern matching (Jeju Island, 19-22 June 2005)Apostolico, Alberto; Crochemore, Maxime; Park, Kunsoo et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26201-6, XI, 444 p, isbn 3-540-26201-6Conference Proceedings

An efficient algorithm for the longest tandem scattered subsequence problemKOSOWSKI, Adrian.Lecture notes in computer science. 2004, pp 93-100, issn 0302-9743, isbn 3-540-23210-9, 8 p.Conference Paper

Finding cross-lingual spelling variantsLINDEN, Krister.Lecture notes in computer science. 2004, pp 136-137, issn 0302-9743, isbn 3-540-23210-9, 2 p.Conference Paper

Inferring Query performance using pre-retrieval predictorsHE, Ben; OUNIS, Iadh.Lecture notes in computer science. 2004, pp 43-54, issn 0302-9743, isbn 3-540-23210-9, 12 p.Conference Paper

  • Page / 6